On Synchronizing Sequences and Test Sequence Partitioning
نویسندگان
چکیده
We consider two topics related to testing of synchronous sequential circuits. The first topic deals with synchronizable circuits and their synchronizing sequences. Synchronizing sequences are important in facilitating the test generation process for detectable faults, and in identifying undetectable faults. They are also important in determining whether an undetectable fault can be removed from a circuit without affecting its normal operation. We show a class of faults for which a synchronizing sequence for the faulty circuit can be easily determined from the synchronizing sequence of the fault free circuit. We also consider circuits that have a reset mechanism, and show how reset can ensure that no single fault would cause the circuit to become unsynchronizable. The second topic we consider deals with test sequence partitioning to speed up static test compaction. We propose a procedure for partitioning a given test sequence into subsequences such that the cumulative fault coverage of all the subsequences, when applied as independent test sequences, is equal to the fault coverage of the original sequence. Each subsequence can then be compacted independently.
منابع مشابه
Synchronizing sequences on not strongly connected Petri nets
Abstract: In testing Discrete Event System, an important topic is determining the final state of the machine after the application of a test. Synchronizing and homing sequences have been proposed in the sixties to solve the problem using Mealy machines. A synchronizing sequence drives an implementation of a given model, seen as a black box, to a known state regardless of its initial state and t...
متن کاملNew Algorithms for Finding Short Reset Sequences in Synchronizing Automata
Finding synchronizing sequences for the finite automata is a very important problem in many practical applications (part orienters in industry, reset problem in biocomputing theory, network issues etc). Problem of finding the shortest synchronizing sequence is NP-hard, so polynomial algorithms probably can work only as heuristic ones. In this paper we propose two versions of polynomial algorith...
متن کاملGenerating Shortest Synchronizing Sequences using Answer Set Programming
For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be performed in polynomial time. However, the problem of finding a shortest synchronizing sequence is known to be NP-hard. In this work, the usefulness of Answer Set Pr...
متن کاملThe Complexity of Synchronizing Markov Decision Processes
We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is psynchronizing if the probability mass is at least p in a single state, or in a given set of states. We consider four temporal synchronizing modes: a sequence of probability distributions is always p-synchronizing, eventually p-synchronizing, weakly psyn...
متن کاملReduced checking sequences using unreliable reset
The length of a checking sequence (CS) generated from a deterministic, minimal, and completely specified finite state machine model M of a system under test which does not have a reliable reset feature, is exponential when M does not have a distinguishing sequence. This is due to the exponential length locating sequences that need to be used in such a CS. In this work, we propose a method to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998